Ensembles of Classifiers Based on Approximate Reducts

ثبت نشده
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ensembles of Classifiers Based on Approximate Reducts

The problem of improving rough set based expert systems by modifying a notion of reduct is discussed. The notion of approximate reduct is introduced, as well as some proposals of quality measure for such a reduct. The complete classifying system based on approximate reducts is presented and discussed. It is proved that the problem of finding optimal set of classifying agents based on approximat...

متن کامل

Fault Detection of Bearings Using a Rule-based Classifier Ensemble and Genetic Algorithm

This paper proposes a reduct construction method based on discernibility matrix simplification. The method works with genetic algorithm. To identify potential problems and prevent complete failure of bearings, a new method based on rule-based classifier ensemble is presented. Genetic algorithm is used for feature reduction. The generated rules of the reducts are used to build the candidate base...

متن کامل

Partial Volume Effect Detection in Mri Segmentation Based on Approximate Decision Reducts

Segmentation of Magnetic Resonance Imaging (MRI) is a process of assigning tissue class labels to voxels. One of the main sources of segmentation error is the partial volume effect (PVE) which occurs most often with low resolution images – with large voxels, the probability of a voxel containing multiple tissue classes increases. We propose a multistage algorithm for segmenting MRI images with ...

متن کامل

Application of Discernibility Tables to Calculation of Approximate Frequency Based Reducts

We provide the unified methodology for searching for approximate decision reducts based on rough membership distributions. Presented study generalizes well known relationships between rough set reducts and boolean prime implicants.

متن کامل

Order Based Genetic Algorithms for the Search of Approximate Entropy Reducts

We use entropy to extend the rough set based notion of a reduct. We show that the order based genetic algorithms, applied to the search of classical decision reducts, can be used in exactly the same way in case of extracting optimal approximate entropy reducts from data.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000